ReP USP - Resultado da busca

Artigo de periodico
Complexity and approximability of minimum path-collection exact covers (2023)
Ravelo, Santiago Valdés ; Fernandes, Cristina Gomes
Source: Theoretical Computer Science. Unidade: IME
Subjects: CIÊNCIA DA COMPUTAÇÃO, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RAVELO, Santiago Valdés e FERNANDES, Cristina Gomes. Complexity and approximability of minimum path-collection exact covers. Theoretical Computer Science, v. 942, p. 21-32, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2022.11.022. Acesso em: 27 abr. 2024.
APA
Ravelo, S. V., & Fernandes, C. G. (2023). Complexity and approximability of minimum path-collection exact covers. Theoretical Computer Science, 942, 21-32. doi:10.1016/j.tcs.2022.11.022
NLM
Ravelo SV, Fernandes CG. Complexity and approximability of minimum path-collection exact covers [Internet]. Theoretical Computer Science. 2023 ; 942 21-32.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2022.11.022
Vancouver
Ravelo SV, Fernandes CG. Complexity and approximability of minimum path-collection exact covers [Internet]. Theoretical Computer Science. 2023 ; 942 21-32.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2022.11.022
Artigo de periodico
Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs (2023)
Gómez, Renzo ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Theoretical Computer Science. Unidade: IME
Subjects: TEORIA DOS GRAFOS, TEORIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GÓMEZ, Renzo e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs. Theoretical Computer Science, v. 947, n. artigo 113691, p. 1-13, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2023.113691. Acesso em: 27 abr. 2024.
APA
Gómez, R., Miyazawa, F. K., & Wakabayashi, Y. (2023). Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs. Theoretical Computer Science, 947( artigo 113691), 1-13. doi:10.1016/j.tcs.2023.113691
NLM
Gómez R, Miyazawa FK, Wakabayashi Y. Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs [Internet]. Theoretical Computer Science. 2023 ; 947( artigo 113691): 1-13.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2023.113691
Vancouver
Gómez R, Miyazawa FK, Wakabayashi Y. Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs [Internet]. Theoretical Computer Science. 2023 ; 947( artigo 113691): 1-13.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2023.113691
Artigo de periodico
Local-entity resolution for building location-based social networks by using stay points (2021)
Minatel, Diego ; Ferreira, Vinicius; Lopes, Alneu de Andrade
Source: Theoretical Computer Science. Unidade: ICMC
Subjects: REDES COMPLEXAS, SISTEMA DE POSICIONAMENTO GLOBAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MINATEL, Diego e FERREIRA, Vinicius e LOPES, Alneu de Andrade. Local-entity resolution for building location-based social networks by using stay points. Theoretical Computer Science, v. 851, n. Ja 2021, p. 62-76, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2020.10.013. Acesso em: 27 abr. 2024.
APA
Minatel, D., Ferreira, V., & Lopes, A. de A. (2021). Local-entity resolution for building location-based social networks by using stay points. Theoretical Computer Science, 851( Ja 2021), 62-76. doi:10.1016/j.tcs.2020.10.013
NLM
Minatel D, Ferreira V, Lopes A de A. Local-entity resolution for building location-based social networks by using stay points [Internet]. Theoretical Computer Science. 2021 ; 851( Ja 2021): 62-76.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2020.10.013
Vancouver
Minatel D, Ferreira V, Lopes A de A. Local-entity resolution for building location-based social networks by using stay points [Internet]. Theoretical Computer Science. 2021 ; 851( Ja 2021): 62-76.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2020.10.013
Artigo de periodico
A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem (2019)
Ravelo, Santiago Valdés; Ferreira, Carlos Eduardo
Source: Theoretical Computer Science. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RAVELO, Santiago Valdés e FERREIRA, Carlos Eduardo. A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem. Theoretical Computer Science, v. 771, p. 9-22, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2018.11.008. Acesso em: 27 abr. 2024.
APA
Ravelo, S. V., & Ferreira, C. E. (2019). A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem. Theoretical Computer Science, 771, 9-22. doi:10.1016/j.tcs.2018.11.008
NLM
Ravelo SV, Ferreira CE. A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem [Internet]. Theoretical Computer Science. 2019 ; 771 9-22.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2018.11.008
Vancouver
Ravelo SV, Ferreira CE. A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem [Internet]. Theoretical Computer Science. 2019 ; 771 9-22.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2018.11.008
Artigo de periodico
Algorithms to compute the burrows-wheeler similarity distribution (2019)
Louza, Felipe Alves da ; Telles, Guilherme Pimentel ; Gog, Simon; Liang, Zhao
Source: Theoretical Computer Science. Unidade: FFCLRP
Subjects: ALGORITMOS, COMPUTABILIDADE E COMPLEXIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LOUZA, Felipe Alves da et al. Algorithms to compute the burrows-wheeler similarity distribution. Theoretical Computer Science, v. 782, p. 145-156, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2019.03.012. Acesso em: 27 abr. 2024.
APA
Louza, F. A. da, Telles, G. P., Gog, S., & Liang, Z. (2019). Algorithms to compute the burrows-wheeler similarity distribution. Theoretical Computer Science, 782, 145-156. doi:10.1016/j.tcs.2019.03.012
NLM
Louza FA da, Telles GP, Gog S, Liang Z. Algorithms to compute the burrows-wheeler similarity distribution [Internet]. Theoretical Computer Science. 2019 ; 782 145-156.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2019.03.012
Vancouver
Louza FA da, Telles GP, Gog S, Liang Z. Algorithms to compute the burrows-wheeler similarity distribution [Internet]. Theoretical Computer Science. 2019 ; 782 145-156.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2019.03.012
Artigo de periodico
Kinetic clustering of points on the line (2016)
Fernandes, Cristina Gomes ; Oshiro, Marcio Takashi Iura
Source: Theoretical Computer Science. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, GEOMETRIA COMPUTACIONAL, ALGORITMOS GEOMÉTRICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e OSHIRO, Marcio Takashi Iura. Kinetic clustering of points on the line. Theoretical Computer Science, v. 639, p. 60-71, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2016.05.020. Acesso em: 27 abr. 2024.
APA
Fernandes, C. G., & Oshiro, M. T. I. (2016). Kinetic clustering of points on the line. Theoretical Computer Science, 639, 60-71. doi:10.1016/j.tcs.2016.05.020
NLM
Fernandes CG, Oshiro MTI. Kinetic clustering of points on the line [Internet]. Theoretical Computer Science. 2016 ; 639 60-71.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2016.05.020
Vancouver
Fernandes CG, Oshiro MTI. Kinetic clustering of points on the line [Internet]. Theoretical Computer Science. 2016 ; 639 60-71.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2016.05.020
Artigo de periodico-carta/editorial
Special issue: Selected papers of the 7th and 8th workshops on Logical and Semantic Frameworks with Applications (LSFA). [Editorial] (2015)
Finger, Marcelo (Editor) ; Kesner, Delia (Editor)
Source: Theoretical Computer Science. Unidade: IME
Subjects: RACIOCÍNIO PROBABILÍSTICO, LINGUÍSTICA COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
Special issue: Selected papers of the 7th and 8th workshops on Logical and Semantic Frameworks with Applications (LSFA). [Editorial]. Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.tcs.2015.10.028. Acesso em: 27 abr. 2024. , 2015
APA
Special issue: Selected papers of the 7th and 8th workshops on Logical and Semantic Frameworks with Applications (LSFA). [Editorial]. (2015). Special issue: Selected papers of the 7th and 8th workshops on Logical and Semantic Frameworks with Applications (LSFA). [Editorial]. Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.tcs.2015.10.028
NLM
Special issue: Selected papers of the 7th and 8th workshops on Logical and Semantic Frameworks with Applications (LSFA). [Editorial] [Internet]. Theoretical Computer Science. 2015 ; no 2015) 1.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2015.10.028
Vancouver
Special issue: Selected papers of the 7th and 8th workshops on Logical and Semantic Frameworks with Applications (LSFA). [Editorial] [Internet]. Theoretical Computer Science. 2015 ; no 2015) 1.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2015.10.028
Artigo de periodico
A class of cubic Rauzy fractals (2015)
Bastos, J; Messaoudi, A; Rodrigues, T; Smania, Daniel
Source: Theoretical Computer Science. Unidade: ICMC
Subjects: TEORIA ERGÓDICA, DINÂMICA UNIDIMENSIONAL, SISTEMAS DINÂMICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BASTOS, J et al. A class of cubic Rauzy fractals. Theoretical Computer Science, v. 588, p. 114-130, 2015Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2015.04.007. Acesso em: 27 abr. 2024.
APA
Bastos, J., Messaoudi, A., Rodrigues, T., & Smania, D. (2015). A class of cubic Rauzy fractals. Theoretical Computer Science, 588, 114-130. doi:10.1016/j.tcs.2015.04.007
NLM
Bastos J, Messaoudi A, Rodrigues T, Smania D. A class of cubic Rauzy fractals [Internet]. Theoretical Computer Science. 2015 ; 588 114-130.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2015.04.007
Vancouver
Bastos J, Messaoudi A, Rodrigues T, Smania D. A class of cubic Rauzy fractals [Internet]. Theoretical Computer Science. 2015 ; 588 114-130.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2015.04.007
Artigo de periodico
Hardness and inapproximability of convex recoloring problems (2014)
Campêlo, Manoel; Huiban, Cristiana Gomes; Sampaio, Rudini Menezes; Wakabayashi, Yoshiko
Source: Theoretical Computer Science. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DOS GRAFOS, ANÁLISE DE ALGORITMOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPÊLO, Manoel et al. Hardness and inapproximability of convex recoloring problems. Theoretical Computer Science, v. 533, p. 15-25, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2014.03.017. Acesso em: 27 abr. 2024.
APA
Campêlo, M., Huiban, C. G., Sampaio, R. M., & Wakabayashi, Y. (2014). Hardness and inapproximability of convex recoloring problems. Theoretical Computer Science, 533, 15-25. doi:10.1016/j.tcs.2014.03.017
NLM
Campêlo M, Huiban CG, Sampaio RM, Wakabayashi Y. Hardness and inapproximability of convex recoloring problems [Internet]. Theoretical Computer Science. 2014 ; 533 15-25.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2014.03.017
Vancouver
Campêlo M, Huiban CG, Sampaio RM, Wakabayashi Y. Hardness and inapproximability of convex recoloring problems [Internet]. Theoretical Computer Science. 2014 ; 533 15-25.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2014.03.017
Artigo de periodico
Second-price ad auctions with binary bids and markets with good competition (2014)
Fernandes, Cristina Gomes ; Schouery, Rafael Crivellari Saliba
Source: Theoretical Computer Science. Conference titles: International Symposium on Combinatorial Optimization. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DOS JOGOS, MATEMÁTICA ECONÔMICA, TEORIA DOS GRAFOS, MERCADO FINANCEIRO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e SCHOUERY, Rafael Crivellari Saliba. Second-price ad auctions with binary bids and markets with good competition. Theoretical Computer Science, v. 540-541, p. 103-114, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2013.08.022. Acesso em: 27 abr. 2024.
APA
Fernandes, C. G., & Schouery, R. C. S. (2014). Second-price ad auctions with binary bids and markets with good competition. Theoretical Computer Science, 540-541, 103-114. doi:10.1016/j.tcs.2013.08.022
NLM
Fernandes CG, Schouery RCS. Second-price ad auctions with binary bids and markets with good competition [Internet]. Theoretical Computer Science. 2014 ; 540-541 103-114.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2013.08.022
Vancouver
Fernandes CG, Schouery RCS. Second-price ad auctions with binary bids and markets with good competition [Internet]. Theoretical Computer Science. 2014 ; 540-541 103-114.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2013.08.022
Artigo de periodico
Semantics and proof-theory of depth bounded Boolean logics (2013)
D'Agostino, Marcello; Finger, Marcelo ; Gabbay, Dov
Source: Theoretical Computer Science. Unidade: IME
Assunto: LÓGICA MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
D'AGOSTINO, Marcello e FINGER, Marcelo e GABBAY, Dov. Semantics and proof-theory of depth bounded Boolean logics. Theoretical Computer Science, v. 480, p. 43-68, 2013Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2013.02.014. Acesso em: 27 abr. 2024.
APA
D'Agostino, M., Finger, M., & Gabbay, D. (2013). Semantics and proof-theory of depth bounded Boolean logics. Theoretical Computer Science, 480, 43-68. doi:10.1016/j.tcs.2013.02.014
NLM
D'Agostino M, Finger M, Gabbay D. Semantics and proof-theory of depth bounded Boolean logics [Internet]. Theoretical Computer Science. 2013 ; 480 43-68.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2013.02.014
Vancouver
D'Agostino M, Finger M, Gabbay D. Semantics and proof-theory of depth bounded Boolean logics [Internet]. Theoretical Computer Science. 2013 ; 480 43-68.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2013.02.014
Artigo de periodico
Evolutionary Fuzzy clustering of relational data (2011)
Horta, Danilo; Andrade, Ivan Caramello de; Campello, Ricardo José Gabrielli Barreto
Source: Theoretical Computer Science. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HORTA, Danilo e ANDRADE, Ivan Caramello de e CAMPELLO, Ricardo José Gabrielli Barreto. Evolutionary Fuzzy clustering of relational data. Theoretical Computer Science, v. 412, n. 42, p. 5854-5870, 2011Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2011.05.039. Acesso em: 27 abr. 2024.
APA
Horta, D., Andrade, I. C. de, & Campello, R. J. G. B. (2011). Evolutionary Fuzzy clustering of relational data. Theoretical Computer Science, 412( 42), 5854-5870. doi:10.1016/j.tcs.2011.05.039
NLM
Horta D, Andrade IC de, Campello RJGB. Evolutionary Fuzzy clustering of relational data [Internet]. Theoretical Computer Science. 2011 ; 412( 42): 5854-5870.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2011.05.039
Vancouver
Horta D, Andrade IC de, Campello RJGB. Evolutionary Fuzzy clustering of relational data [Internet]. Theoretical Computer Science. 2011 ; 412( 42): 5854-5870.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2011.05.039
Artigo de periodico
Testing permutation properties through subpermutations (2011)
Hoppen, Carlos; Kohayakawa, Yoshiharu ; Moreira, Carlos Gustavo; Sampaio, Rudini Menezes
Source: Theoretical Computer Science. Unidade: IME
Assunto: TEORIA DOS GRUPOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HOPPEN, Carlos et al. Testing permutation properties through subpermutations. Theoretical Computer Science, v. 412, n. 29, p. 3555-3567, 2011Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2011.03.002. Acesso em: 27 abr. 2024.
APA
Hoppen, C., Kohayakawa, Y., Moreira, C. G., & Sampaio, R. M. (2011). Testing permutation properties through subpermutations. Theoretical Computer Science, 412( 29), 3555-3567. doi:10.1016/j.tcs.2011.03.002
NLM
Hoppen C, Kohayakawa Y, Moreira CG, Sampaio RM. Testing permutation properties through subpermutations [Internet]. Theoretical Computer Science. 2011 ; 412( 29): 3555-3567.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2011.03.002
Vancouver
Hoppen C, Kohayakawa Y, Moreira CG, Sampaio RM. Testing permutation properties through subpermutations [Internet]. Theoretical Computer Science. 2011 ; 412( 29): 3555-3567.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2011.03.002
Artigo de periodico
The maximum agreement forest problem: approximation algorithms and computational experiments (2007)
Rodrigues, Estela Maris; Sagot, Marie-France; Wakabayashi, Yoshiko
Source: Theoretical Computer Science. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RODRIGUES, Estela Maris e SAGOT, Marie-France e WAKABAYASHI, Yoshiko. The maximum agreement forest problem: approximation algorithms and computational experiments. Theoretical Computer Science, v. 374, n. 1-3, p. 91-110, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2006.12.011. Acesso em: 27 abr. 2024.
APA
Rodrigues, E. M., Sagot, M. -F., & Wakabayashi, Y. (2007). The maximum agreement forest problem: approximation algorithms and computational experiments. Theoretical Computer Science, 374( 1-3), 91-110. doi:10.1016/j.tcs.2006.12.011
NLM
Rodrigues EM, Sagot M-F, Wakabayashi Y. The maximum agreement forest problem: approximation algorithms and computational experiments [Internet]. Theoretical Computer Science. 2007 ; 374( 1-3): 91-110.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2006.12.011
Vancouver
Rodrigues EM, Sagot M-F, Wakabayashi Y. The maximum agreement forest problem: approximation algorithms and computational experiments [Internet]. Theoretical Computer Science. 2007 ; 374( 1-3): 91-110.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2006.12.011
Artigo de periodico
Algorithms for terminal Steiner trees (2007)
Martinez, Fábio Viduani; Pina Júnior, José Coelho de; Soares, Jose Augusto Ramos
Source: Theoretical Computer Science. Unidade: IME
Assunto: ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MARTINEZ, Fábio Viduani e PINA JÚNIOR, José Coelho de e SOARES, Jose Augusto Ramos. Algorithms for terminal Steiner trees. Theoretical Computer Science, v. 389, n. 1-2, p. 133-142, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2007.08.001. Acesso em: 27 abr. 2024.
APA
Martinez, F. V., Pina Júnior, J. C. de, & Soares, J. A. R. (2007). Algorithms for terminal Steiner trees. Theoretical Computer Science, 389( 1-2), 133-142. doi:10.1016/j.tcs.2007.08.001
NLM
Martinez FV, Pina Júnior JC de, Soares JAR. Algorithms for terminal Steiner trees [Internet]. Theoretical Computer Science. 2007 ; 389( 1-2): 133-142.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2007.08.001
Vancouver
Martinez FV, Pina Júnior JC de, Soares JAR. Algorithms for terminal Steiner trees [Internet]. Theoretical Computer Science. 2007 ; 389( 1-2): 133-142.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2007.08.001
Artigo de periodico
The universe of propositional approximations (2006)
Finger, Marcelo ; Wassermann, Renata
Source: Theoretical Computer Science. Unidade: IME
Assunto: LÓGICA MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo e WASSERMANN, Renata. The universe of propositional approximations. Theoretical Computer Science, v. 355, n. 2, p. 153-166, 2006Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2006.01.007. Acesso em: 27 abr. 2024.
APA
Finger, M., & Wassermann, R. (2006). The universe of propositional approximations. Theoretical Computer Science, 355( 2), 153-166. doi:10.1016/j.tcs.2006.01.007
NLM
Finger M, Wassermann R. The universe of propositional approximations [Internet]. Theoretical Computer Science. 2006 ; 355( 2): 153-166.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2006.01.007
Vancouver
Finger M, Wassermann R. The universe of propositional approximations [Internet]. Theoretical Computer Science. 2006 ; 355( 2): 153-166.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2006.01.007
Artigo de periodico
The decidability of a fragment of BB'IW-logic (2004)
Broda, Sabine; Damas, Luís; Finger, Marcelo ; Silva, Paulo J. S.
Source: Theoretical Computer Science. Unidade: IME
Assunto: LÓGICA MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BRODA, Sabine et al. The decidability of a fragment of BB'IW-logic. Theoretical Computer Science, v. 318, n. 3, p. 373-408, 2004Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2004.02.002. Acesso em: 27 abr. 2024.
APA
Broda, S., Damas, L., Finger, M., & Silva, P. J. S. (2004). The decidability of a fragment of BB'IW-logic. Theoretical Computer Science, 318( 3), 373-408. doi:10.1016/j.tcs.2004.02.002
NLM
Broda S, Damas L, Finger M, Silva PJS. The decidability of a fragment of BB'IW-logic [Internet]. Theoretical Computer Science. 2004 ; 318( 3): 373-408.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2004.02.002
Vancouver
Broda S, Damas L, Finger M, Silva PJS. The decidability of a fragment of BB'IW-logic [Internet]. Theoretical Computer Science. 2004 ; 318( 3): 373-408.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2004.02.002
Artigo de periodico
Searching in Random partially ordered sets (2004)
Carmo, Renato José da Silva; Donadelli Junior, Jair; Kohayakawa, Yoshiharu ; Laber, Eduardo Sany
Source: Theoretical Computer Science. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CARMO, Renato José da Silva et al. Searching in Random partially ordered sets. Theoretical Computer Science, v. 321, n. 1, p. 41-57, 2004Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2003.06.001. Acesso em: 27 abr. 2024.
APA
Carmo, R. J. da S., Donadelli Junior, J., Kohayakawa, Y., & Laber, E. S. (2004). Searching in Random partially ordered sets. Theoretical Computer Science, 321( 1), 41-57. doi:10.1016/j.tcs.2003.06.001
NLM
Carmo RJ da S, Donadelli Junior J, Kohayakawa Y, Laber ES. Searching in Random partially ordered sets [Internet]. Theoretical Computer Science. 2004 ; 321( 1): 41-57.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2003.06.001
Vancouver
Carmo RJ da S, Donadelli Junior J, Kohayakawa Y, Laber ES. Searching in Random partially ordered sets [Internet]. Theoretical Computer Science. 2004 ; 321( 1): 41-57.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.tcs.2003.06.001
Artigo de periodico
Some properties of recognizable Z-subsets (2003)
Kobayashi, Nami
Source: Theoretical Computer Science. Unidade: IME
Assunto: AUTÔMATOS FINITOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOBAYASHI, Nami. Some properties of recognizable Z-subsets. Theoretical Computer Science, v. 293, n. 1, p. 83-113, 2003Tradução . . Disponível em: https://doi.org/10.1016/S0304-3975(02)00233-5. Acesso em: 27 abr. 2024.
APA
Kobayashi, N. (2003). Some properties of recognizable Z-subsets. Theoretical Computer Science, 293( 1), 83-113. doi:10.1016/S0304-3975(02)00233-5
NLM
Kobayashi N. Some properties of recognizable Z-subsets [Internet]. Theoretical Computer Science. 2003 ; 293( 1): 83-113.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/S0304-3975(02)00233-5
Vancouver
Kobayashi N. Some properties of recognizable Z-subsets [Internet]. Theoretical Computer Science. 2003 ; 293( 1): 83-113.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/S0304-3975(02)00233-5
Artigo de periodico
Cube packing (2003)
Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Theoretical Computer Science. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Cube packing. Theoretical Computer Science, v. 297, n. 1/3, p. 355-366, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0304-3975(02)00647-3. Acesso em: 27 abr. 2024.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2003). Cube packing. Theoretical Computer Science, 297( 1/3), 355-366. doi:10.1016/s0304-3975(02)00647-3
NLM
Miyazawa FK, Wakabayashi Y. Cube packing [Internet]. Theoretical Computer Science. 2003 ; 297( 1/3): 355-366.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/s0304-3975(02)00647-3
Vancouver
Miyazawa FK, Wakabayashi Y. Cube packing [Internet]. Theoretical Computer Science. 2003 ; 297( 1/3): 355-366.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/s0304-3975(02)00647-3

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Funding Agencies

Indexado em

Normalized affiliation

Non normalized affiliation

Countries of institutions of collaboration